Equivalence between intersection cuts and the corner polyhedron
نویسندگان
چکیده
Intersection cuts were introduced by Balas and the corner polyhedron by Gomory. Balas showed that intersection cuts are valid for the corner polyhedron. In this paper we show that, conversely, every nontrivial facet-defining inequality for the corner polyhedron is an intersection cut.
منابع مشابه
Every Nontrivial Facet-Defining Inequality for the Corner Polyhedron is an Intersection Cut
Intersection cuts were introduced by Balas and the corner polyhedron by Gomory. It is a classical result that intersection cuts are valid for the corner polyhedron. In this paper we show that, conversely every nontrivial facet-defining inequality for the corner polyhedron is an intersection cut.
متن کاملCorner Polyhedron and Intersection Cuts
Four decades ago, Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau form and Balas introduced intersection cuts for the corner polyhedron. A recent paper of Andersen, Louveaux, Weismantel and Wolsey has generated a renewed interest in the corner polyhedron and intersection cuts. We survey these two approaches and the recent developments in multi-row cuts....
متن کاملConstant factor approximations with families of intersection cuts
We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets. In particular, we look that the problem of characterizing families that approximate the corner polyhedron up to a constant factor. The literature already contains several results in this direction. In this paper, we use the maximum number of facets of a lattice-free se...
متن کاملA geometric approach to cut-generating functions
The cutting-plane approach to integer programming was initiated more that 40 years ago: Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau form and Balas introduced intersection cuts for the corner polyhedron. This line of research was left dormant for several decades until relatively recently, when a paper of Andersen, Louveaux, Weismantel and Wolsey gene...
متن کاملA note on the MIR closure and basic relaxations of polyhedra
Anderson, Cornuéjols and Li (2005) show that for a polyhedral mixed integer set defined by a constraint system Ax ≥ b, where x is n-dimensional, along with integrality restrictions on some of the variables, any split cut is in fact a split cut for a basic relaxation, i.e., one defined by a subset of linearly independent constraints. This result implies that any split cut can be obtained as an i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 38 شماره
صفحات -
تاریخ انتشار 2010